Regional Location Routing Problem for Waste Collection Using Hybrid Genetic Algorithm-Simulated Annealing

Municipal waste management has become a challenging issue with the rise in urban populations and changes people’s habits, particularly developing countries. Moreover, government policy plays an important role associated municipal management. Thus, this research proposes regional location routing problem (RLRP) model multi-depot (MRLRP) model, which are extensions of (LRP), to provide better collection process. The is constructed cover minimum number depot facilities’ requirements for each region due policy, i.e., large-scale social restrictions region. goal determine locations vehicles’ routes collecting fulfill inter-regional independent needs at total cost. This conducts numerical examples actual data illustrate implements hybrid genetic algorithm simulated annealing optimization solve problem. results show that proposed method efficiently solves RLRP MRLRP.